Decomposing the queue length distribution of processor-sharing models into queue lengths of permanent customer queues
نویسندگان
چکیده
منابع مشابه
Decomposing the queue length distribution of processor-sharing models into queue lengths of permanent customer queues
We obtain a decomposition result for the steady state queue length distribution in egalitarian processor-sharing (PS) models. In particular, for an egalitarian PS queue with K customer classes, we show that the marginal queue length distribution for class k factorizes over the number of other customer types. The factorizing coefficients equal the queue length probabilities of a PS queue for typ...
متن کاملMonotonicity in the limited processor sharing queue
We study a processor sharing queue with a limited number of service positions and an infinite buffer. The occupied service positions share an underlying resource. We prove that for service times with a decreasing failure rate, the queue length is stochastically decreasing in the number of service positions, and that for service times with an increasing failure rate, the queue length is stochast...
متن کاملEstimation for queues from queue length data
We consider the estimation of arrival and service rates for queues based on queue length data collected at successive, not necessarily equally spaced, time points. In particular, we consider the M/M/c queue, for c large, but application of the method to the repairman problem is almost identical, and the general approach presented should extend to other queue types. The estimation procedure make...
متن کاملOn a processor sharing queue that models balking
We consider the processor sharing M/M/1-PS queue which also models balking. A customer that arrives and sees n others in the system “balks” (i.e., decides not to enter) with probability 1 − bn. If bn is inversely proportional to n + 1, we obtain explicit expressions for a tagged customer’s sojourn time distribution. We consider both the conditional distribution, conditioned on the number of oth...
متن کاملFluid approximations for a processor-sharing queue
This paper studies the uid approximation, also known as the functional strong law-of-large-numbers, for a GI/G/1 queue under a processor-sharing service discipline. The uid (approximation) limit in general depends on the service time distribution, and the convergence is in general in the Skorohod J 1 topology. This is in contrast to the known result for the GI/G/1 queue under a FIFO service dis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Performance Evaluation
سال: 2005
ISSN: 0166-5316
DOI: 10.1016/j.peva.2005.07.009